Local blow-up of stratified sets up to bordism

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on blow-up in parabolic equations with local and localized sources

‎This note deals with the systems of parabolic equations with local and localized sources involving $n$ components‎. ‎We obtained the exponent regions‎, ‎where $kin {1,2,cdots,n}$ components may blow up simultaneously while the other $(n-k)$ ones still remain bounded under suitable initial data‎. ‎It is proved that different initial data can lead to different blow-up phenomena even in the same ...

متن کامل

On the blow-up of a non-local parabolic problem

We investigate the conditions under which the solution of the initial-boundary value problem of the non-local equation ut = u + λ f (u)/( ∫ Ω f (u) dx) p , where Ω is a bounded domain of RN and f (u) is a positive, increasing, convex function, performs blow-up. c © 2005 Elsevier Ltd. All rights reserved.

متن کامل

Testing Graph Blow-Up

Referring to the query complexity of testing graph properties in the adjacency matrix model, we advance the study of the class of properties that can be tested non-adaptively within complexity that is inversely proportional to the proximity parameter. Arguably, this is the lowest meaningful complexity class in this model, and we show that it contains a very natural class of graph properties. Sp...

متن کامل

Homogenization by blow-up

In this paper we highlight how the Fonseca and Müller blow-up technique is particularly well suited for homogenization problems. As examples we give a simple proof of the nonlinear homogenization theorem for integral functionals and we prove a homogenization theorem for sets of finite perimeter.

متن کامل

Blow-Up Lemma

The Regularity Lemma [16] is a powerful tool in Graph Theory and its applications. It basically says that every graph can be well approximated by the union of a constant number of random-looking bipartite graphs called regular pairs (see the definitions below). These bipartite graphs share many local properties with random bipartite graphs, e.g. most degrees are about the same, most pairs of ve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1982

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1982-0664041-5